Lucky experiment

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lucky Factors

We propose a new method to select amongst a large group of candidate factors — many of which might arise as a result of data mining — that purport to explain the cross-section of expected returns. The method is robust to general distributional characteristics of both factor and asset returns. We allow for the possibility of time-series as well as cross-sectional dependence. The technique accomm...

متن کامل

A Lucky Wound

an absolute bull's-eye through the face and out at the back of the neck, and was inflicted by a rifle bullet. He was not rendered unconscious, and was seen only shortly after, by the regimental doctor, Lieutenant Baker, i.m.s. He was transferred the same day to the ambulance, where a detailed examination was made, which has led to the report. There was a small entrance wound just beneath the br...

متن کامل

BioCode: Third time lucky?

Fifteen year ago a draft BioCode was presented to the taxonomic community (Greuter et al. 1996). There is now a new version, published in Taxon (Greuter et al. 2011) and available online on the International Committee on Biological Nomenclature website as well as that of the International Commision for Zoological Nomenclature. Has the BioCode matured since it was last put forward? Was it ahead ...

متن کامل

On Lucky Primes

Winkler (1988) and Pauer (1992) present algorithms for a Hensel lifting of a modular Gröbner basis over lucky primes to a rational one. They have to solve a linear system with modular polynomial entries that requires another (modular) Gröbner basis computation. After an extension of luckiness to arbitrary (commutative noetherian) base rings we show in this paper that for a homogeneous polynomia...

متن کامل

Lucky labelings of graphs

Suppose the vertices of a graph G were labeled arbitrarily by positive integers, and let S(v) denote the sum of labels over all neighbors of vertex v. A labeling is lucky if the function S is a proper coloring of G, that is, if we have S(u) 6= S(v) whenever u and v are adjacent. The least integer k for which a graph G has a lucky labeling from the set f1; 2; : : : ; kg is the lucky number of G,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EMBO reports

سال: 2002

ISSN: 1469-221X,1469-3178

DOI: 10.1093/embo-reports/kvf210